Systematic Literature Review on Adjustable Robust Shortest Path Problem
نویسندگان
چکیده
In real-world optimization problems, effective path planning is important. The Shortest Path Problem (SPP) model a classical operations research that can be applied to determine an efficient from the starting point end in plan. However, real world, uncertainty often encountered and must faced. Significant factors problem of determining shortest are problems difficult predict, therefore new criteria appropriate models needed deal with along required solution. factor formulated using uncertain SPP model, assuming parameters not known certainty but set. Problems mathematical solved Robust Optimization (RO). RO methodology dealing data caused by errors measurement. linear formed loading only exists constraint function its Counterpart (RC) methodology. this paper, we will review literature on two-stage for Adjustable (ARC).
منابع مشابه
On the robust shortest path problem
The shortest path (SP) problem in a network with nonnegative arc lengths can be solved easily by Dijkstra’s labeling algorithm in polynomial time. In the case of significant uncertainty of the arc lengths, a robustness approach is more appropriate. In this paper, we study the SP problem under arc length uncertainties. A scenario approach is adopted to characterize uncertainties. Two robustness ...
متن کاملDistributionally robust stochastic shortest path problem
This paper considers a stochastic version of the shortest path problem, the Distributionally Robust Stochastic Shortest Path Problem(DRSSPP) on directed graphs. In this model, the arc costs are deterministic, while each arc has a random delay. The mean vector and the second-moment matrix of the uncertain data are assumed known, but the exact information of the distribution is unknown. A penalty...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملRobust shortest path problems
This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...
متن کاملThe shortest path problem
The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the d-dimensional space of deformation parameters. Fission half lives of heavy isotopes (100<Z<110) are shown and compared to the experimental data. 1. Introductory remark...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cauchy
سال: 2023
ISSN: ['2477-3344', '2086-0382']
DOI: https://doi.org/10.18860/ca.v7i4.17648